Informativeness of experiments for MEU—A recursive definition

Recursive Function Definition for Types with Binders

This work describes the proof and uses of a theorem allowing definition of recursive functions over the type of λ-calculus terms, where terms with bound variables are identified up to α-equivalence. The theorem embodies what is effectively a principle of primitive recursion, and the analogues of this theorem for other types with binders are clear. The theorem’s side-conditions require that the ...

Recursive definition of global cellular-automata mappings.

SFI WORKING PAPER: 1992-07-036 SFI Working Papers contain accounts of scientific work of the author(s) and do not necessarily represent the views of the Santa Fe Institute. We accept papers intended for publication in peer-reviewed journals or proceedings volumes, but not papers that have already appeared in print. Except for papers by our external faculty, papers must be based on work done at ...

Definition of Flat Poset and Existence Theorems for Recursive

Reduction Systems and Idea of Knuth-Bendix Completion Algorithm By Grzegorz Bancerek . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 Double Series and Sums By Noboru Endou . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57 Dual Spaces and Hahn-Banach Theorem By Keiko Narita, Noboru Endou, and Yasunari Shidama 69 Semiring of Sets By Roland Coghetto . ...

Definition of Flat Poset and Existence Theorems for Recursive Call

This text includes the definition and basic notions of product of posets, chain-complete and flat posets, flattening operation, and the existence theorems of recursive call using the flattening operator. First part of the article, devoted to product and flat posets has a purely mathematical quality. Definition 3 allows to construct a flat poset from arbitrary non-empty set [12] in order to prov...

Recursive Function Definition over Coinductive Types